Edge Colorings and Circular Flow Numbers of Regular Graphs
نویسنده
چکیده
The paper characterizes (2t + 1)-regular graphs with circular flow number 2 + 2 2t−1 . For t = 1 this is Tutte’s characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs where a flow number separates the class 1 graphs from the class 2 graphs. We finally state some conjectures and relate them to existing flow-conjectures.
منابع مشابه
Circular colorings of edge-weighted graphs
The notion of (circular) colorings of edge-weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds to the traveling salesman problem (metric case). It also gives rise to a new definition of the ch...
متن کاملDegree-constrained spanning trees
S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-...
متن کاملHajj Os Theorem for Colorings of Edge-weighted Graphs
Hajj os theorem states that every graph with chromatic number at least k can be obtained from the complete graph K k by a sequence of simple operations such that every intermediate graph also has chromatic number at least k. Here, Hajj os theorem is extended in three slightly diierent ways to colorings and circular colorings of edge-weighted graphs. These extensions shed some new light on the H...
متن کاملHajós Theorem For Colorings Of Edge-Weighted Graphs
Hajj os theorem states that every graph with chromatic number at least k can be obtained from the complete graph K k by a sequence of simple operations such that every intermediate graph also has chromatic number at least k. Here, Hajj os theorem is extended in three slightly diierent ways to colorings and circular colorings of edge-weighted graphs. These extensions shed some new light on the H...
متن کاملSkew Chromatic Index of Circular Ladder Graphs
Abstract. A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, an algorithm is determined for skew edge coloring of circular ladder graphs. Alsothe skew chromatic index of circular la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 79 شماره
صفحات -
تاریخ انتشار 2015